Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.


↳ QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(id, x0)
app(plus, 0)
app(app(plus, app(s, x0)), x1)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) → APP(plus, x)

The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(id, x0)
app(plus, 0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) → APP(plus, x)

The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(id, x0)
app(plus, 0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) → APP(plus, x)

The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(id, x0)
app(plus, 0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)

The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(id, x0)
app(plus, 0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  APP(x1, x2)
app(x1, x2)  =  app(x1, x2)
plus  =  plus
s  =  s
0  =  0
id  =  id

Recursive Path Order [2].
Precedence:
s > plus > APP2 > app2
[0, id]


The following usable rules [14] were oriented:

app(plus, 0) → id



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ QDP
                  ↳ QDPOrderProof
                    ↳ QDP
                      ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(id, x0)
app(plus, 0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.